Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
نویسنده
چکیده
A simple-triangle graph (also known as a PI graph) is the intersection graph of a family of triangles defined by a point on a horizontal line and an interval on another horizontal line. The recognition problem for simple-triangle graphs was a longstanding open problem, and recently a polynomial-time algorithm has been given [G. B. Mertzios, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, SIAM J. Discrete Math., 29(3):1150–1185, 2015]. Along with the approach of this paper, we show a simpler recognition algorithm for simple-triangle graphs. To do this, we provide a polynomial-time algorithm to solve the following problem: Given a bipartite graph G and a set F of edges of G, find a 2-chain subgraph cover of G such that one of two chain subgraphs has no edges in F.
منابع مشابه
Parameterized Complexity of Neighborhood Problems in Graphs with no Small Cycles
We show that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles. More specifically, we give fixed parameter algorithms for Dominating Set, t-Vertex Cover (where we need to cover at least t edges) and several of their variants on graphs that have no triangles or cycles of length 4. These p...
متن کاملNP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be NP-complete on arbitrary graphs. We show that this problem remains NP-complete even when restricted to planar graphs and perfect graphs.
متن کاملRooted induced trees in triangle-free graphs
For a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G that is a tree. Further, for a vertex v ∈ V (G), let t(G, v) denote the maximum number of vertices in an induced subgraph of G that is a tree, with the extra condition that the tree must contain v. The minimum of t(G) (t(G, v), respectively) over all connected triangle-free graphs G (and vertices v ∈ V (G)...
متن کاملOn the Complexity of the k-Chain Subgraph Cover Problem
The k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the union of the edge sets of k chain graphs, where each chain graph is a subgraph of G. Although the X--chain subgraph cover problem is known to be NP-complete for the class of bipartite graphs, it is still unknown whether this problem is NP-complete or polynomial-time solvable for subclasses of bipartite g...
متن کاملDivide-and-Conquer Approximation Algorithm for Vertex Cover
The vertex cover problem is a classical NP-complete problem for which the best worstcase approximation ratio is 2−o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to find approximate vertex covers for a large collection of randomly generated graphs and test graphs from various sources. The graph reductions are ext...
متن کامل